How Many Queries are Needed to Distinguish a Truncated Random Permutation from a Random Function?
نویسندگان
چکیده
منابع مشابه
Distinguishing a truncated random permutation from a random function
An oracle chooses a function f from the set of n bits strings to itself, which is either a randomly chosen permutation or a randomly chosen function. When queried by an n-bit string w, the oracle computes f(w), truncates the m last bits, and returns only the first n −m bits of f(w). How many queries does a querying adversary need to submit in order to distinguish the truncated permutation from ...
متن کاملHow many random restarts are enough?
Many machine learning problems, such as K-means, are non-convex optimization problems. Usually they are solved by performing several local searches with random initializations. How many searches should be done? Typically a fixed number is performed, but how do we know it was enough? We present a new stopping rule with non-asymptotic frequentist guarantees, which, to our knowledge, no existing r...
متن کاملHow many eigenvalues of a Gaussian random matrix are positive?
We study the probability distribution of the index N(+), i.e., the number of positive eigenvalues of an N×N Gaussian random matrix. We show analytically that, for large N and large N(+) with the fraction 0≤c=N(+)/N≤1 of positive eigenvalues fixed, the index distribution P(N(+)=cN,N)~exp[-βN(2)Φ(c)] where β is the Dyson index characterizing the Gaussian ensemble. The associated large deviation r...
متن کاملHow Many Eigenvalues of a Random Matrix Are Real ? Alan
Let A be an n x n matrix whose elements are independent randomvariables with standard normal distributions. As n ..... 00 , the expected numberof real eigenvalues is asymptotic to .J2nln. We obtain a closed form expres-sion for the expected number of real eigenvalues for finite n, and a formula forthe density of a real eigenvalue for finite n. Asymptotically, a real normalized<l...
متن کاملHow many zeros of a random polynomial are real?
Abstract. We provide an elementary geometric derivation of the Kac integral formula for the expected number of real zeros of a random polynomial with independent standard normally distributed coefficients. We show that the expected number of real zeros is simply the length of the moment curve (1, t, . . . , tn) projected onto the surface of the unit sphere, divided by π. The probability density...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cryptology
سال: 2017
ISSN: 0933-2790,1432-1378
DOI: 10.1007/s00145-017-9253-0